On alternation numbers of links

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the hull numbers of torus links

Introduced in [1] by Jason Cantarella, Greg Kuperberg, Robert B. Kusner, and John M. Sullivan, the hull number is a complexity measure for links similar to the bridge number. By definition, it is the maximum integer n such that for any realization of the link there is a point c ∈ R such that any plane through c intersects the curves representing the link at least 2n times. Clearly, the hull num...

متن کامل

Alternation Numbers of Torus Knots with Small Braid Index

We calculate the alternation number of torus knots with braid index 4 and less. For the lower bound, we use the Upsilon-invariant recently introduced by Ozsváth, Stipsicz, and Szabó. For the upper bound, we use a known bound for braid index 3 and a new bound for braid index 4. Both bounds coincide, so that we obtain a sharp result.

متن کامل

Upper Bounds on Linking Numbers of Thick Links

The maximum of the linking number between two lattice polygons of lengths n1, n2 (with n1 ≤ n2) is proven to be of the order of n1(n2) 1 3 . This result is generalized to smooth links of unit thickness. The result also implies that the writhe of a lattice knot K of length n is at most 26 n4/3/π. In the second half of the paper examples are given to show that linking numbers of order n1(n2) 1 3 ...

متن کامل

Crosscap Numbers of Two-component Links

We define the crosscap number of a 2-component link as the minimum of the first Betti numbers of connected, nonorientable surfaces bounding the link. We discuss some properties of the crosscap numbers of 2-component links.

متن کامل

Alternation on Cellular Automata

In this paper we consider several notions of alternation in cellular automata: non-uniform, uniform and weak alternation. We study relations among these notions and with alternating Turing machines. It is proved that the languages accepted in polynomial time by alternating Turing machines are those accepted by alternating cellular automata in polynomial time for all the proposed alternating cel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2010

ISSN: 0166-8641

DOI: 10.1016/j.topol.2009.04.027